Monadic Sequence Testing and Explicit Test-Refinements
نویسندگان
چکیده
We present an abstract framework for sequence testing that is implemented in Isabelle/HOL-TestGen. Our framework is based on the theory of state-exception monads, explicitly modelled in HOL, and can cope with typed input and output, interleaving executions including abort, and synchronisation. The framework is particularly geared towards symbolic execution and has proven effective in several large case-studies involving system models based on large (or infinite) state. On this basis, we rephrase the concept of test-refinements for inclusion, deadlock and IOCO-like tests, together with a formal theory of its relation to traditional, IO-automata based notions.
منابع مشابه
Communicating Haskell Processes: Composable Explicit Concurrency using Monads
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell’s monads provide a way to explicitly specify sequence and effects in a functional language, and monadic combinators allow composition of monadic actions, for example via parallelism and choice – two core aspects of Communicating Sequential Processes (CSP).We show how t...
متن کاملStudy of Explicit Knowledge Effects on Implicit Motor Learning in Older Adults
Objective: The motor skill performance and learning in older adults are of a great importance. The primary purpose of this study was to determine whether older adult’s explicit knowledge effect on implicit learning and motor performance and which are typical for rehabilitation and skills acquired in older adults. Materials & Methods: In this comparative study a serial reaction time task by u...
متن کاملAbstraction and Performance from Explicit Monadic Reflection
Most of the existing literature about monadic programming focuses on theory but does not address issues of software engineering. Using monadic parsing as a running example, we demonstrate monadic programs written in a typical style, recognize how they violate abstraction boundaries, and recover clean abstraction crossings through monadic reflection. Once monadic reflection is made explicit, it ...
متن کاملActive Set Identification for Linearly Constrained Minimization Without Explicit Derivatives
We consider active set identification for linearly constrained optimization problems in the absence of explicit information about the derivative of the objective function. We begin by presenting some general results on active set identification that are not tied to any particular algorithm. These general results are sufficiently strong that, given a sequence of iterates converging to a Karush–K...
متن کاملAbstraction and Performance from Explicit Monadic Re ection
ion and Performance from Explicit Monadic Re ection Jonathan Sobel Erik Hilsdale R. Kent Dybvig Daniel P. Friedman Department of Computer Science
متن کامل